n,m = map(int,input().split())
p = set()
for i in range(n):p.add(input())
e = set()
for i in range(m):e.add(input())
t = p&e; p = p-t; e = e-t
print("YNEOS"[len(p)+ len(t)%2<=len(e)::2])
1400A - String Similarity | 1734E - Rectangular Congruence |
1312D - Count the Arrays | 424C - Magic Formulas |
1730C - Minimum Notation | 1730B - Meeting on the Line |
1730A - Planets | 302B - Eugeny and Play List |
1730D - Prefixes and Suffixes | 1515C - Phoenix and Towers |
998A - Balloons | 1734F - Zeros and Ones |
1144B - Parity Alternated Deletions | 92B - Binary Number |
1144C - Two Shuffled Sequences | 1154B - Make Them Equal |
1272B - Snow Walking Robot | 522B - Photo to Remember |
608B - Hamming Distance Sum | 1408F - Two Different |
274B - Zero Tree | 1726H - Mainak and the Bleeding Polygon |
722A - Broken Clock | 129B - Students and Shoelaces |
697B - Barnicle | 903D - Almost Difference |
1443B - Saving the City | 1215C - Swap Letters |
1251C - Minimize The Integer | 1494B - Berland Crossword |